Some arithmetic functions of factorials in Lucas sequences
نویسندگان
چکیده
We prove that if {un}n≥ 0 is a nondegenerate Lucas sequence, then there are only finitely many effectively computable positive integers n such |un|=f(m!), where f either the sum-of-divisors function, or sum-of-proper-divisors Euler phi function. also give theorem holds for more general class of integer sequences and illustrate our results through few specific examples. This paper motivated by previous work Iannucci Luca who addressed above problem with Catalan numbers
منابع مشابه
Diophantine Equations Involving Arithmetic Functions of Factorials
DIOPHANTINE EQUATIONS INVOLVING ARITHMETIC FUNCTIONS OF FACTORIALS Daniel M. Baczkowski We examine and classify the solutions to certain Diophantine equations involving factorials and some well known arithmetic functions. F. Luca has showed that there are finitely many solutions to the equation:
متن کاملFrom tent-like functions to Lucas sequences
Counting the number of periodic points of a function leads to results on congruences for the terms of a sequence. Fermat’s little theorem (and also its generalization by Euler) can be proved in a simple way, for instance; see [2] and [3]. The paper [5] contains a characterization of the sequences which are realisable, that is, sequences which actually appear when counting periodic points of fun...
متن کاملEquations Involving Arithmetic Functions of Fibonacci and Lucas Numbers
For any positive integer k, let (k) and a(k) be the number of positive integers less than or equal to k and relatively prime to k and the sum of divisors ofk, respectively. In [6] we have shown that 0(Fn) > F^n) and that a(Fn) < Fa{ri) and we have also determined all the cases in which the above inequalities become equalities. A more general inequality of this type was proved in [7]. In [8] ...
متن کاملSome Arithmetic Properties of Certain Sequences
In an earlier paper it was argued that two sequences, denoted by {Un} and {Wn}, constitute the sextic analogues of the well-known Lucas sequences {un} and {vn}. While a number of the properties of {Un} and {Wn} were presented, several arithmetic properties of these sequences were only mentioned in passing. In this paper we discuss the derived sequences {Dn} and {En}, where Dn = gcd(Wn − 6R n, U...
متن کاملSome Identities for Generalized Fibonacci and Lucas Sequences
In this study, we define a generalization of Lucas sequence {pn}. Then we obtain Binet formula of sequence {pn} . Also, we investigate relationships between generalized Fibonacci and Lucas sequences.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasnik Matematicki
سال: 2021
ISSN: ['1846-7989', '0017-095X']
DOI: https://doi.org/10.3336/gm.56.1.02